An Analysis of Weighted Least Squares Method and Layered Least Squares Method with the Basis Block Lower Triangular Matrix Form∗
نویسندگان
چکیده
In this paper, we analyze the limiting behavior of the weighted least squares problem minx∈<n Pp i=1 kDi(Aix − bi)k2, where each Di is a positive definite diagonal matrix. We consider the situation where the magnitude of the weights are drastically different block-wisely so that max(D1) ≥ min(D1) À max(D2) ≥ min(D2) À max(D3) ≥ . . . À max(Dp−1) ≥ min(Dp−1)À max(Dp). Here max(·) and min(·) represents the maximum and minimum entries of diagonal elements, respectively. Specifically, we consider the case when the gap g ≡ mini 1/(kD−1 i kkDi+1k) is very large or tends to infinity. Vavasis and Ye proved that the limiting solution exists (when the proportion of diagonal elements within each block Di is unchanged and only the gap g tends to∞), and showed that the limit is characterized as the solution of a variant of the least squares problem called the layered least squares (LLS) problem. We analyze the difference between the solutions of WLS and LLS quantitatively and show that the norm of the difference of the two solutions is bounded above by O(χAχ̄ 2(p+1) A g −2kbk) and O(χ̄ A g −2kbk) in the variable and the residual spaces, respectively, using the two condition numbers χA ≡ maxB∈B kB−1k and χ̄A ≡ maxB∈B kB−1Ak of A, where B is the set of all nonsingular n×n submatrix of A, A = [A1; . . . ;Ap] and b = [b1; . . . ; bp]. A remarkable feature of this result is the error bound is represented in terms of A, g (and b) and independent of the weights Di, i = 1, . . . , p. The analysis is carried out by making the change of variables to convert the matrix A into a basis lower-triangular form and then by applying the Sharmann-Morrison-Woodbury formula. ∗A part of this research was supported with Grant-in-Aid for Scientific Research (B), 2008, 20340024 from the Japan Society for the Promotion of Science. †Graduate School of Decision Science and Technology, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552 Japan ([email protected]). ‡The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, Tokyo 106-8569 Japan ([email protected]).
منابع مشابه
OPTIMAL SHAPE DESIGN OF GRAVITY DAMS BASED ON A HYBRID META-HERURISTIC METHOD AND WEIGHTED LEAST SQUARES SUPPORT VECTOR MACHINE
A hybrid meta-heuristic optimization method is introduced to efficiently find the optimal shape of concrete gravity dams including dam-water-foundation rock interaction subjected to earthquake loading. The hybrid meta-heuristic optimization method is based on a hybrid of gravitational search algorithm (GSA) and particle swarm optimization (PSO), which is called GSA-PSO. The operation of GSA-PSO...
متن کاملLarge Scale Experiments Data Analysis for Estimation of Hydrodynamic Force Coefficients Part 1: Time Domain Analysis
This paper describes various time-domain methods useful for analyzing the experimental data obtained from a circular cylinder force in terms of both wave and current for estimation of the drag and inertia coefficients applicable to the Morison’s equation. An additional approach, weighted least squares method is also introduced. A set of data obtained from experiments on heavily roughened circul...
متن کاملTheory of block-pulse functions in numerical solution of Fredholm integral equations of the second kind
Recently, the block-pulse functions (BPFs) are used in solving electromagnetic scattering problem, which are modeled as linear Fredholm integral equations (FIEs) of the second kind. But the theoretical aspect of this method has not fully investigated yet. In this article, in addition to presenting a new approach for solving FIE of the second kind, the theory of both methods is investigated as a...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملPositive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کامل